Brute-force search
COMPUTER PROBLEM-SOLVING TECHNIQUE
Brute force computing; Brute force search; Brute search; Brute force key search; Brute force programming; Brute-force string search; Uninformed search; Exhaustive search; Naïve solution; Naive solution; Uninformed Search; Brute force string search
In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement.